An Improved Protocol Reachability Analysis Technique

نویسنده

  • Gerard J. Holzmann
چکیده

An automated analysis of all reachable states in a distributed system can be used to trace obscure logical errors that would be very hard to find manually. This type of validation is traditionally performed by the symbolic execution of a finite state machine (FSM) model of the system studied. The application of this method to systems of a practical size, though, is complicated by time and space requirements. If a system is larger, more space is needed to store the state descriptions and more time is needed to compare and analyze these states. This paper shows that if the FSM model is abandoned and replaced by a state vector model significant gains in performance are feasible, for the first time making it possible to perform effective validations of large systems. Software, Practice and Experience, Vol. 18, No. 2, pp. 137−161, 1988.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

Protocol Verification by Leaping Reachability Analysis

he communicating finite state machine (CFSM) model is one of the most widely used models for specifying and verifying communications protocols. In this model, a protocol is specified as a network of two or more processes exchanging messages over error-free simplex channels, where each process is a finite state machine (FSM) and each simplex channel is a FIFO queue. Protocol verification is ofte...

متن کامل

Reverse Reachability Analysis a New Technique for Deadlock Detection on Communicating Finite State Machines

The communicating finite state machines can exchange messages over bounded FIFO channels. In this paper, a new technique, called reverse reachability analysis, is proposed to detect deadlocks on the communication between the communicating finite state machines. The technique is based on finding reverse reachable paths starting from possible deadlock states. If a reverse reachable path can reach...

متن کامل

Using Forward Reachability Analysis for Verification of Timed Petri Nets

We consider verification of safety properties for concurrent real-timed systems modelled as timed Petri nets, by performing symbolic forward reachability analysis. We introduce a formalism, called region generators for representing sets of markings of timed Petri nets. Region generators characterize downward closed sets of regions, and provide exact abstractions of sets of reachable states with...

متن کامل

Improving the Reachability Analysis Technique by Circuit Retiming

Implicit reachable state computation can be applied to a wide range of sequential formal veriication and logic synthesis problems. Symbolic manipulation with BDDs is one of the most eecient techniques known for the reachability analysis. The technique was rst proposed by Coudert et al. in 1989, and was improved later by Touati et al. in 1990. The standard approach chooses the cut of a sequentia...

متن کامل

Deadlock Detection in CFSM Models via Simultaneously Executable Sets

Reachability analysis is an extensively used technique in many areas such as protocol verification and concurrent program verification. The main limitation of this technique is its exponential complexity, i.e., the state explosion problem. The major contributor to the state explosion problem has been known as concurrency. Rather than examining all possible interleavings of concurrent behavior d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Softw., Pract. Exper.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1988